Erratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]

In the paper Pedersen, Nielsen, and Andersen [5] we developed an algorithm for ranking n×n assignments using reoptimization and compare our algorithm with other algorithms with the same time complexity. However, as pointed out by Dr. A. Volgenant, we unfortunately missed one available implementation written by Miller, Stone, and Cox [3] in IEEE Transactions on Aerospace and Electronic Systems. The algorithm of Miller et al. [3] (Miller) and Pedersen et al. [5] (DU1) are both based on the branching technique presented in Murty [4] where the set of possible assignments is partitioned into at most n−1 disjoint subsets for each additional ranking made. In each subset the best assignment is found by applying the successive shortest path procedure implementation of Jonker and Volgenant [2]. The algorithms differ in the following ways: